منابع مشابه
Small generators of function fields
Let K/k be a finite extension of a global field. Such an extension can be generated over k by a single element. The aim of this article is to prove the existence of a ”small” generator in the function field case. This answers the function field version of a question of Ruppert on small generators of number fields.
متن کاملNumber Fields without Small Generators
Let D > 1 be an integer, and let b = b(D) > 1 be its smallest divisor. We show that there are infinitely many number fields of degree D whose primitive elements all have relatively large height in terms of b, D and the discriminant of the number field. This provides a negative answer to a questions of W. Ruppert from 1998 in the case when D is composite. Conditional on a very weak form of a fol...
متن کاملOn Generators in Archimedean Copulas
This study after reviewing construction methods of generators in Archimedean copulas (AC), proposes several useful lemmas related with generators of AC. Then a new trigonometric Archimedean family will be shown which is based on cotangent function. The generated new family is able to model the low dependence structures.
متن کاملInduction Generators for Small Wind Energy Systems
tions in his research fields including the book ‘Control in Power Electronics’ (Eds. M.P. Kazmierkowski, R. Krishnan, F. Blaabjerg) 2002, Academic Press. During the last years he has held a number of chairman positions in research policy and research funding bodies in Denmark. He is associated editor of the IEEE Transactions on Industry Applications, IEEE Transactions on Power Electronics, Jour...
متن کاملLecture 8 : Applications of Small - Bias Generators
In the previous lecture, we developed the basics of harmonic analysis and used them to quantitatively show that every small-bias generator is almost k-wise uniform. This led to an -PRG for k-wise uniformity with seed length O(k + log(1/ ) + log r), where r denotes the output length. In this lecture we give a construction that improves the dependence on r to O(log log r), and for this we again u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90058-6